#include"BinaryTree.h"
#include"Queue.h"

int main()
{
	BTNode* root = CreateTree();
	PrevOrder(root);
	printf("\n");

	InOrder(root);
	printf("\n");

	/*size = 0;
	TreeSize(root);
	printf("TreeSize:%d\n", size);

	size = 0;
	TreeSize(root);
	printf("TreeSize:%d\n", size);

	size = 0;
	TreeSize(root);
	printf("TreeSize:%d\n", size);*/


	printf("TreeSize:%d\n", TreeSize(root));
	printf("TreeSize:%d\n", TreeSize(root));
	printf("TreeSize:%d\n", TreeSize(root));

	printf("TreeLeafSize:%d\n", TreeLeafSize(root));
	printf("TreeHeight:%d\n", TreeHeight(root));
	printf("TreeLevelK:%d\n", TreeLevelK(root, 4));

	BTNode* ret = TreeFind(root, 5);
	printf("TreeFind:%p\n", ret);
	//ret->data++;
	printf("TreeComplete:%d\n", TreeComplete(root));

	//PrevOrder(root);
	//printf("\n");

	//LevelOrder(root);

	DestroyTree(root);
	root = NULL;

	return 0;
}